Polynomial Kernelizations for MIN F+Pi1 and MAX NP
نویسنده
چکیده
The relation of constant-factor approximability to fixed-parameter tractability and kernelization is a long-standing open question. We prove that two large classes of constant-factor approximable problems, namely MIN FΠ1 and MAX NP, including the well-known subclass MAX SNP, admit polynomial kernelizations for their natural decision versions. This extends results of Cai and Chen (JCSS 1997), stating that the standard parameterizations of problems in MAX SNP and MIN FΠ1 are fixed-parameter tractable, and complements recent research on problems that do not admit polynomial kernelizations (Bodlaender et al. ICALP 2008).
منابع مشابه
Complexity of the Min-Max (Regret) Versions of Cut Problems
This paper investigates the complexity of the min-max and min-max regret versions of the s− t min cut and min cut problems. Even if the underlying problems are closely related and both polynomial, we show that the complexity of their min-max and min-max regret versions, for a constant number of scenarios, are quite contrasted since they are respectively strongly NP-hard and polynomial. Thus, we...
متن کاملComplexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and both polynomial, the complexity of their min-max and min-max regret versions, for a constant number of scenarios, is quite contrasted since they are respectively strongly NP hard and polynomial. However, for a non cons...
متن کاملLinear Kernelizations for Restricted 3-Hitting Set Problems
The 3-Hitting Set problem, also called the Vertex Cover problem on 3-uniform hypergraphs, cannot be solved in polynomial time unless P=NP. However, this problem is fixed-parameter tractable in the parameterized complexity, which means that it has kernelizations. In this paper, we address such kernelizations of the Vertex Cover problem on 3-uniform hypergraphs. Moreover, we show that this proble...
متن کاملApproximating a two-machine flow shop scheduling under discrete scenario uncertainty
This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job processing times are uncertain and they are specified as a discrete scenario set. For this uncertainty representation, the min-max and min-max regret criteria are adopted. The min-max regret version o...
متن کاملApproximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a bounded number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009